Density Peaks Clustering Based on Weighted Local Density Sequence and Nearest Neighbor Assignment

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Weighted k-Nearest Neighbor Density Estimate for Geometric Inference

Abstract Motivated by a broad range of potential applications in topological and geometric inference, we introduce a weighted version of the knearest neighbor density estimate. Various pointwise consistency results of this estimate are established. We present a general central limit theorem under the lightest possible conditions. In addition, a strong approximation result is obtained and the ch...

متن کامل

Clustering Microarray Data based on Density and Shared Nearest Neighbor Measure

Microarray technology is being used to study several genes at a time generating huge amounts of data. Managing and extracting useful information from such data is a big challenge for the bioinformatics community. Clustering is an important data mining technique that has been proved to be useful for the analysis and understanding of such data. Clustering is used to automatically identify similar...

متن کامل

Clustering by Deep Nearest Neighbor Descent (D-NND): A Density-based Parameter-Insensitive Clustering Method

Most density-based clustering methods largely rely on how well the underlying density is estimated. However, density estimation itself is also a challenging problem, especially the determination of the kernel bandwidth. A large bandwidth could lead to the over-smoothed density estimation in which the number of density peaks could be less than the true clusters, while a small bandwidth could lea...

متن کامل

Clustering-based Nearest Neighbor Searching

This paper proposes a Clustering-based Nearest Neighbor Search algorithm (CNNS) for high dimensional data. Different from existing approaches that are based on rigid-grid partition to develop data access structure, CNNS creates indexing structures according to data inherent distribution, with help of a progressive-styled clustering operation. The grids produced in this way adapt to data natural...

متن کامل

Uniform-in-Bandwidth Nearest-Neighbor Density Estimation

We are concerned with the nonparametric estimation of the density f(·) of a random variable [rv] X ∈ R by the nearest-neighbor [NN] method. The NN estimators are motivated as follows (see, e.g., Fix and Hodges [17]). Let X1,X2, . . . be independent and identically distributed [iid] random copies of X, with distribution function [df] F(x) := P(X ≤ x), for x ∈ R. Denote the empirical df based upo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2019

ISSN: 2169-3536

DOI: 10.1109/access.2019.2904254